On Weight Hierarchies of Product Codes The Wei-Yang Conjecture and more

نویسندگان

  • Conchita Martínez-Pérez
  • Hans Georg Schaathun
  • Wolfgang Willems
چکیده

The weight of a code is the number of coordinate positions where no codeword is zero. The rth minimum weight dr is the least weight of an r-dimensional subcode. Wei and Yang conjectured a formula for the minimum weights of some product codes. The conjecture is proved in two di erent ways, each with interesting side-results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lower Bound on the Weight Hierarchies of Product Codes

The weight of a code is the number of coordinate positions where not all codewords are zero. The rth minimum weight dr is the least weight of an r-dimensional subcode. Wei and Yang conjectured a formula for the minimum weights of some product codes, and this conjecture has recently been proved in two di2erent ways. In this self-contained paper, we give a further generalisation, with a new proof...

متن کامل

The weight hierarchy of product codes

The weight of a code is the number of coordinate positions where no codeword is zero. The th minimum weight is the least weight of an -dimensional subcode. Wei and Yang gave a conjecture about the minimum weights for some product codes. In this correspondence, we will find a relation between product codes and the Segre embedding of a pair of projective systems, and we use this to prove the conj...

متن کامل

Harder-Narasimhan theory for linear codes

In this text we develop some aspects of Harder-Narasimhan theory, slopes, semistability and canonical filtration, in the setting of combinatorial lattices. Of noticeable importance is the Harder-Narasimhan structure associated to a Galois connection between two lattices. It applies, in particular, to matroids. We then specialize this to linear codes. This could be done from at least three diffe...

متن کامل

A new kind of geometric structures determining the chain good weight hierarchies

In this paper, by using a new kind of geometric structures, we present some su/cient conditions to determine the weight hierarchies of linear codes satisfying the chain condition. c © 2002 Elsevier Science B.V. All rights reserved.

متن کامل

$L^p$-Conjecture on Hypergroups

In this paper, we study $L^p$-conjecture on locally compact hypergroups and by some technical proofs we give some sufficient and necessary conditions  for a weighted Lebesgue space  $L^p(K,w)$ to be a convolution Banach algebra, where $1<p<infty$, $K$ is a locally compact hypergroup and $w$ is a weight function on $K$.  Among the other things, we also show that if $K$ is a locally compact hyper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2001